commit orderの例文

• Such can happen since the commit order by the protocol is not necessarily the same as the voting order.
• Tens of STM articles on " commit order " have already been published, and the technique is encumbered by a number of patents.
• The decisions are delivered from the COCO to the database system through their interface, as well as local transactions'commit notifications, at a proper commit order.
• It affects only the commit order, and for this reason it does not need to abort more transactions than those needed to be aborted for serializability violation prevention by any combined local concurrency control mechanism.
• The patent abstract quoted above describes a general implementation of the algorithm with a pre-determined commit order ( this falls into the category of " CO generic algorithm with real-time constraints " ).
• If a precedence relation ( conflict ) exists between two transactions, then the second will not be voted on before the first is completed ( either committed or aborted ), to prevent possible commit order violation by the atomic commitment protocol.
• With the proliferation of Multi-core processors, Optimistic CO ( OCO ) has been also increasingly utilized to achieve serializability in software transactional memory, and numerous STM articles and patents utilizing " commit order " have already been published ( e . g ., Zhang et al . 2006 ).
• The net effect of CO may be, at most, a delay of commit events ( or voting in a distributed environment ), to comply with the needed commit order ( but not more delay than its special cases, for example, SS2PL, and on the average significantly less ).
• With the proliferation of Multi-core processors, variants of the Generic local CO algorithm have been also increasingly utilized in Concurrent programming, Transactional memory, and especially in Software transactional memory for achieving serializability optimistically by " commit order " ( e . g ., Ramadan et al . 2009, Zhang et al . 2006, von Parun et al . 2007 ).